15 research outputs found

    A model of signaling for establishing of LSPs for multicast communication over GMPLS networks

    Get PDF
    Label switching, which in IP networks is exemplified by MPLS and its extensions MPLambdaS and GMPLS, appears as one of the best alternatives to offer a reliable and flexible control plane for WDM networks, since it allows the integration of the IP Protocol with WDM technology, when lambdas are associated with labels, implements powerful traffic-engineering mechanisms, and provides several alternative schemes for fault-tolerance, as well as support for quality of service (QoS). However, almost all the definitions and standardizations for MPLS are restricted to unicast communication, leaving support for multicast communication for future work. In the specific case of the triggering problem for LSPs (Label Switched Paths), there is still no consensus about the best strategy for multicast communication. This paper proposes an algorithm for traffic-driven triggering of LSPs, based on MFCs (Multicast Forwarding Caches), and has the advantage of being a schema which is compatible with several multicast routing protocols. To validate the proposed algorithm we carry out simulation studies using the NS-2 (Network Simulator) simulation platform.5th IFIP International Conference on Network Control & Engineering for QoS, Security and MobilityRed de Universidades con Carreras en Informática (RedUNCI

    A model of signaling for establishing of LSPs for multicast communication over GMPLS networks

    Get PDF
    Label switching, which in IP networks is exemplified by MPLS and its extensions MPLambdaS and GMPLS, appears as one of the best alternatives to offer a reliable and flexible control plane for WDM networks, since it allows the integration of the IP Protocol with WDM technology, when lambdas are associated with labels, implements powerful traffic-engineering mechanisms, and provides several alternative schemes for fault-tolerance, as well as support for quality of service (QoS). However, almost all the definitions and standardizations for MPLS are restricted to unicast communication, leaving support for multicast communication for future work. In the specific case of the triggering problem for LSPs (Label Switched Paths), there is still no consensus about the best strategy for multicast communication. This paper proposes an algorithm for traffic-driven triggering of LSPs, based on MFCs (Multicast Forwarding Caches), and has the advantage of being a schema which is compatible with several multicast routing protocols. To validate the proposed algorithm we carry out simulation studies using the NS-2 (Network Simulator) simulation platform.5th IFIP International Conference on Network Control & Engineering for QoS, Security and MobilityRed de Universidades con Carreras en Informática (RedUNCI

    A Scheduling Algorithm for Computational Grids that Minimizes Centralized Processing in Genome Assembly of Next-Generation Sequencing Data

    Get PDF
    Improvements in genome sequencing techniques have resulted in generation of huge volumes of data. As a consequence of this progress, the genome assembly stage demands even more computational power, since the incoming sequence files contain large amounts of data. To speed up the process, it is often necessary to distribute the workload among a group of machines. However, this requires hardware and software solutions specially configured for this purpose. Grid computing try to simplify this process of aggregate resources, but do not always offer the best performance possible due to heterogeneity and decentralized management of its resources. Thus, it is necessary to develop software that takes into account these peculiarities. In order to achieve this purpose, we developed an algorithm aimed to optimize the functionality of de novo assembly software ABySS in order to optimize its operation in grids. We run ABySS with and without the algorithm we developed in the grid simulator SimGrid. Tests showed that our algorithm is viable, flexible, and scalable even on a heterogeneous environment, which improved the genome assembly time in computational grids without changing its quality
    corecore